GSCS - Graph Stream Classification with Side Information
نویسندگان
چکیده
With the popularity of applications like Internet, sensor network and social network, which generate graph data in stream form, graph stream classification has become an important problem. Many applications are generating side information associated with graph stream, such as terms and keywords in authorship graph of research papers or IP addresses and time spent on browsing in web click graph of Internet users. Although side information associated with each graph object contains semantically relevant information to the graph structure and can contribute much to improve the accuracy of graph classification process, none of the existing graph stream classification techniques consider side information. In this paper, we have proposed an approach,Graph Stream Classification with Side information (GSCS), which incorporates side information along with graph structure by increasing the dimension of the feature space of the data for building a better graph stream classification model. Empirical analysis by experimentation on two real life data sets is provided to depict the advantage of incorporating side information in the graph stream classification process to outperform the state of the art approaches. It is also evident from the experimental results that GSCS is robust enough to be used in classifying graphs in form of stream.
منابع مشابه
On Graph Stream Clustering with Side Information
Graph clustering becomes an important problem due to emerging applications involving the web, social networks and bio-informatics. Recently, many such applications generate data in the form of streams. Clustering massive, dynamic graph streams is significantly challenging because of the complex structures of graphs and computational difficulties of continuous data. Meanwhile, a large volume of ...
متن کاملDetecting Concept Drift in Data Stream Using Semi-Supervised Classification
Data stream is a sequence of data generated from various information sources at a high speed and high volume. Classifying data streams faces the three challenges of unlimited length, online processing, and concept drift. In related research, to meet the challenge of unlimited stream length, commonly the stream is divided into fixed size windows or gradual forgetting is used. Concept drift refer...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملOn Classification of Graph Streams
In this paper, we will examine the problem of classification of massive graph streams. The problem of classification has been widely studied in the database and data mining community. The graph domain poses significant challenges because of the structural nature of the data. The stream scenario is even more challenging, and has not been very well studied in the literature. This is because the u...
متن کاملClassification of rings with toroidal annihilating-ideal graph
Let R be a non-domain commutative ring with identity and A(R) be theset of non-zero ideals with non-zero annihilators. We call an ideal I of R, anannihilating-ideal if there exists a non-zero ideal J of R such that IJ = (0).The annihilating-ideal graph of R is defined as the graph AG(R) with the vertexset A(R) and two distinct vertices I and J are adjacent if and only if IJ =(0). In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015